On the Complexity of Approximate Sum of Sorted List

نویسنده

  • Bin Fu
چکیده

We consider the complexity for computing the approximate sum a1 + a2 + · · · + an of a sorted list of numbers a1 ≤ a2 ≤ · · · ≤ an. We show an algorithm that computes an (1 + ǫ)-approximation for the sum of a sorted list of nonnegative numbers in an O( 1 ǫ min(log n, log(max xmin )) · (log 1 ǫ + log log n)) time, where xmax and xmin are the largest and the least positive elements of the input list, respectively. We prove a lower bound Ω(min(log n, log(max xmin )) time for every O(1)-approximation algorithm for the sum of a sorted list of nonnegative elements. We also show that there is no sublinear time approximation algorithm for the sum of a sorted list that contains at least one negative number.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Approximate Amenability of Direct Sum of Banach Algebras

In the present paper for two $mathfrak{A}$-module Banach algebras $A$ and $B$, we investigate relations between $varphi$-$mathfrak{A}$-module approximate amenability of $A$, $psi$-$mathfrak{A}$-module approximate amenability of $B$, and $varphioplus psi$-$mathfrak{A}$-module approximate amenability of $Aoplus B$ ($l^1$-direct sum of $A$ and $B$), where $varphiin$ Hom$_{mathfrak{A}}(A)$ and $psi...

متن کامل

The Approximate k-List Problem

We study a generalization of the k-list problem, also known as the Generalized Birthday problem. In the k-list problem, one starts with k lists of binary vectors and has to find a set of vectors – one from each list – that sum to the all-zero target vector. In our generalized Approximate k-list problem, one has to find a set of vectors that sum to a vector of small Hamming weight ω. Thus, we re...

متن کامل

A Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems

Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the...

متن کامل

Duals and approximate duals of g-frames in Hilbert spaces

In this paper we get some results and applications for duals and approximate duals of g-frames in Hilbert spaces. In particular, we consider the stability of duals and approximate duals under bounded operators and we study duals and approximate duals of g-frames in the direct sum of Hilbert spaces. We also obtain some results for perturbations of approximate duals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013